Recursive Random Number Generator Using Prime Reciprocals
نویسنده
چکیده
illustration, the prime reciprocal of 1/7 is , and the prime reciprocal sequence is considered to be 142857. The period of this sequence is 6. Since the maximum length of the period can be (p-1), this is an example of a maximum-length d-sequence. But a prime reciprocal sequence that is maximum length in one base need not be maximum length in another base. Thus the binary prime reciprocal sequence corresponding to 1/7 is 001, which has a period of 3. It follows from elementary mathematics that the period of a prime reciprocal must divide (p-1). 7 14285 . 0 &
منابع مشابه
Period of the d-Sequence Based Random Number Generator
This paper presents an expression to compute the exact period of a recursive random number generator based on d-sequences. Using the multi-recursive version of this generator we can produce large number of pseudorandom sequences.
متن کاملAnalysis of Prime Reciprocal Sequences in Base 10
Prime reciprocals have applications in coding and cryptography and for generation of random sequences. This paper investigates the structural redundancy of prime reciprocals in base 10 in a manner that parallels an earlier study for binary prime reciprocals. Several different kinds of structural relationships amongst the digits in reciprocal sequences are classified with respect to the digit in...
متن کاملLarge-Order Multiple Recursive Generators with Modulus 231 - 1
T performance of a maximum-period multiple recursive generator (MRG) depends on the choices of the recurrence order k, the prime modulus p, and the multipliers used. For a maximum-period MRG, a largeorder k not only means a large period length (i.e., p − 1) but, more importantly, also guarantees the equidistribution property in high dimensions (i.e., up to k dimensions), a desirable feature for...
متن کاملA d-Sequence based Recursive Random Number Generator
This paper presents a novel approach to generating binary random numbers using d-sequences. We perform various correlation analyses on the new random number generator and provide a new tool to researchers using which the correlation properties of the random sequences can be controlled as desired.
متن کاملTesting Kak's Conjecture on Binary Reciprocal of Primes and Cryptographic Applications
This note considers reciprocal of primes in binary representation and shows that the conjecture that 0s exceed 1s in most cases continues to hold for primes less than one million. The conjecture has also been tested for ternary representation with similar results. Some applications of this result to cryptography are discussed. Introduction In a note nearly 25 years ago, Kak conjectured [1] that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0907.5226 شماره
صفحات -
تاریخ انتشار 2009